Randomized algorithm

Results: 630



#Item
21Approximating the Size of a Radio Network in Beeping Model Philipp Brandes1 , Marcin Kardas2 , Marek Klonowski2 , Dominik Pająk2 , and Roger Wattenhofer1 ? 1  2

Approximating the Size of a Radio Network in Beeping Model Philipp Brandes1 , Marcin Kardas2 , Marek Klonowski2 , Dominik Pająk2 , and Roger Wattenhofer1 ? 1 2

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-07-19 07:32:17
22Algorithms against Anarchy: Understanding Non-Truthful Mechanisms ¨ PAUL DUTTING , London School of Economics ¨ Informatik THOMAS KESSELHEIM, Max-Planck-Institut fur

Algorithms against Anarchy: Understanding Non-Truthful Mechanisms ¨ PAUL DUTTING , London School of Economics ¨ Informatik THOMAS KESSELHEIM, Max-Planck-Institut fur

Add to Reading List

Source URL: paulduetting.com

Language: English - Date: 2015-06-17 14:01:56
23CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗ Tim Roughgarden† February 5, 2014

CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗ Tim Roughgarden† February 5, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-06-11 16:25:54
24Synchronous Counting and Computational Algorithm Design Danny Dolev School of Engineering and Computer Science, The Hebrew University of Jerusalem

Synchronous Counting and Computational Algorithm Design Danny Dolev School of Engineering and Computer Science, The Hebrew University of Jerusalem

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-09-16 05:51:42
25Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga??

Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga??

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:07:00
26Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1  Max-Planck-Institut f¨

Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:52
27Black-Box Complexity—A Complexity Theory for Evolutionary Computation ´ Presenter: Benjamin Doerr, Ecole Polytechnique de Paris, France; email .

Black-Box Complexity—A Complexity Theory for Evolutionary Computation ´ Presenter: Benjamin Doerr, Ecole Polytechnique de Paris, France; email .

Add to Reading List

Source URL: www.conference123.org

Language: English - Date: 2014-07-16 23:22:02
281  A Randomized Multi-modulo RNS Architecture for Double-and-Add in ECC to prevent Power Analysis Side Channel Attacks Jude Angelo Ambrose†

1 A Randomized Multi-modulo RNS Architecture for Double-and-Add in ECC to prevent Power Analysis Side Channel Attacks Jude Angelo Ambrose†

Add to Reading List

Source URL: www.inesc-id.pt

Language: English - Date: 2013-12-23 08:24:26
29Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation Yuriy Arbitman∗ Moni Naor†

Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation Yuriy Arbitman∗ Moni Naor†

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2010-04-08 04:06:04
30Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:12